Using three-dimensional microfluidic networks for solving computationally hard problems
نویسندگان
چکیده
منابع مشابه
Using three-dimensional microfluidic networks for solving computationally hard problems.
This paper describes the design of a parallel algorithm that uses moving fluids in a three-dimensional microfluidic system to solve a nondeterministically polynomial complete problem (the maximal clique problem) in polynomial time. This algorithm relies on (i) parallel fabrication of the microfluidic system, (ii) parallel searching of all potential solutions by using fluid flow, and (iii) paral...
متن کاملON MAXWELL'S STRESS FUNCTIONS FOR SOLVING THREE DIMENSIONAL ELASTICITY PROBLEMS IN THE THEORY OF ELASTICITY
The governing equations of three dimensional elasticity problems include the six Beltrami-Michell stress compatibility equations, the three differential equations of equilibrium, and the six material constitutive relations; and these are usually solved subject to the boundary conditions. The system of fifteen differential equations is usually difficult to solve, and simplified methods are usual...
متن کاملOn the Power of Neural Networks for Solving Hard Problems
This paper deals with a neural network model in which each neuron performs a threshold logic function. An important property of the model is that it always converges to a stable state when operating in a serial mode [2,5]. This property is the basis of the potential applications of the model such as associative memory devices and combinatorial optimization [3,6]. One of the motivations for use ...
متن کاملSolving “Hard” Satisfiability Problems Using GridSAT
We present the latest instantiation of GridSAT [5], a distributed and complete satisfiability solver that is explicitly designed to aggregate grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We...
متن کاملOwnership using Hard Instances of Computationally Intractable Problems
In this work we present a method for proving copyright ownership based on Zero Knowledge Interactive Proof (ZKIP) protocols for computationally intractable problems. We use the 3-coloring problem, which consists in assigning one of three available colors to the vertices of a graph so that no two adjacent vertices have the same color. Using the presumed computational intractability of this probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2001
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.061014198